A simulation based research on chance constrained programming in robust facility location problem
نویسندگان
چکیده
منابع مشابه
SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملStochastic simulation-based genetic algorithm for chance constrained fractional programming problem
Abstract: The field of chance constrained fractional programming (CCFP) has grown into a huge area over the last few years because of its applications in real life problems. Therefore, finding a solution technique to it is of paramount importance. The solution technique so far has been deriving deterministic equivalence of CCFP with random coefficients in the objective function and/or constrain...
متن کاملA New Chance-Constrained Maximum Capture Location Problem
The paper presents a new model based on the basic Maximum Capture model, MAXCAP. The New Chance – Constrained Maximum Capture model introduces a stochastic threshold constraint, which recognises the fact that a facility can be open only if a minimum level of demand is captured. A metaheuristic based on MAX – MIN ANT system and TABU search procedure is presented to solve the model. This is the f...
متن کاملThe Recoverable Robust Facility Location Problem
This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second st...
متن کاملSequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Physics
سال: 2017
ISSN: 2391-5471
DOI: 10.1515/phys-2017-0010